Monte Carlo Simulations of Innnite Low Density Parity Check Codes over Gf(q)
نویسندگان
چکیده
Binary Low Density Parity Check (LDPC) codes have been shown to have near Shan-non limit performance when decoded using a probabilistic decoding algorithm. The analogous codes deened over nite elds GF(q) of order q > 2 show signiicantly improved performance. We present the results of Monte Carlo simulations of the decoding of innnite LDPC Codes which can be used to obtain good constructions for nite Codes. Our empirical results for the Gaussian channel include a rate 1/4 code with bit error probability of 10 ?4 at E b =N 0 = ?0:05dB.
منابع مشابه
Low Density Parity Check Codes over GF ( q ) Matthew
| Binary Low Density Parity Check (LDPC) codes have been shown to have near Shannon limit performance when decoded using a probabilis-tic decoding algorithm. The analogous codes deened over nite elds GF (q) of order q > 2 show signii-cantly improved performance. We present the results of Monte Carlo simulations of the decoding of inn-nite LDPC Codes which can be used to obtain good construction...
متن کاملModified Log Domain Decoding Algorithm for LDPC Codes over GF ( q )
Abstract— A modified log domain decoding algorithm of Low density parity check (LDPC) codes over GF(q) using permutation to simplify the parity check equation is presented in this paper which is different from the conventional log domain decoding algorithm of Low Density Parity Check (LDPC) codes over GF(q) [11]. Modified Log domain is mathematically equivalent to the conventional log domain ...
متن کاملA method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes
An algorithm for constructing parity-check matrices of nonbinary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). Firstly the algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of t...
متن کاملInformation Reconciliation for Continuous-Variable Quantum Key Distribution using Non-Binary Low-Density Parity-Check Codes
An information reconciliation method for continuous-variable quantum key distribution with Gaussian modulation that is based on non-binary low-density paritycheck (LDPC) codes is presented. Sets of regular and irregular LDPC codes with different code rates over the Galois fields GF(8), GF(16), GF(32), and GF(64) have been constructed. We have performed simulations to analyze the efficiency and ...
متن کاملDesign and Analysis of E2 RC Codes Using EXIT Chart
We present the design and analysis of a family of codes based on the efficiently-encodable rate-compatible irregular LDPC codes (ERC codes) introduced by Kim, Ramamoorthy and Mclaughlin ‘06. The basic idea is to utilize the structured parity part (of the parity check matrix) of ERC codes and design optimal degree distributions for the systematic part based on EXIT chart analysis. In this work, ...
متن کامل